A Dynamic Perfect Hash Function Defined by an Extended Hash Indicator Table
نویسندگان
چکیده
This paper presents a new dynamic file organization scheme based on hashing. The hash functions used here, being defined by extended hash indicator tables (EHITs), are both dynamic and perfect. The allocated storage space can be enlarged and shrunk without reorganizing the data file. Simulation results show'that the storage utilization is approximately equal to 70% in an experiment where the number of rehash functions s=7, the size of a segment r=lO, and the size of the key set n varies from 1 to 1000. Since the hash functions are perfect, the retrieval operation needs only one disk access.
منابع مشابه
An Improved Hash Function Based on the Tillich-Zémor Hash Function
Using the idea behind the Tillich-Zémor hash function, we propose a new hash function. Our hash function is parallelizable and its collision resistance is implied by a hardness assumption on a mathematical problem. Also, it is secure against the known attacks. It is the most secure variant of the Tillich-Zémor hash function until now.
متن کاملImage databases and near-perfect hash table
The 2D-string is one of the important data structures to represent spatial information in images and has been used to perform queries in image database systems. A 2D string can be readily converted to a set of triples which can be used to generate a perfect hash table for indexing the image database. The perfect hash table allows for O(1) retrieval in image database but the computation of the h...
متن کاملMaintaining External Memory Efficient Hash Tables
In typical applications of hashing algorithms the amount of data to be stored is often too large to fit into internal memory. In this case it is desirable to find the data with as few as possible non-consecutive or at least non-oblivious probes into external memory. Extending a static scheme of Pagh [11] we obtain new randomized algorithms for maintaining hash tables, where a hash function can ...
متن کاملFinding Succinct Ordered Minimal Perfect Hash Functions
An ordered minimal perfect hash table is one in which no collisions occur among a prede ned set of keys, no space is unused and the data are placed in the table in order. A new method for creating ordered minimal perfect hash functions is presented. It creates hash functions with representation space requirements closer to the theoretical lower bound than previous methods. The method presented ...
متن کاملTetris-Hashing or optimal table compression
In this paper, we present a new method for mapping a static set of n keys, each an integer between 0 and N ? 1, into a hash table of size n without any collision. Our data structure requires only an additional array of n integers, each less than n, and achieves a worst case lookup time of O(1). This method is based on a randomized compression scheme, and it nds a minimal perfect hash function i...
متن کامل